Verifying Nondeterministic Implementations of Deterministic Systems
نویسندگان
چکیده
منابع مشابه
Verifying Nondeterministic Implementations of Deterministic Systems1
Abstract. Some modern systems with a simple deterministic high-level specification have implementations that exhibit highly nondeterministic behavior. Such systems maintain a simple operation semantics at the high-level. However their underlying implementations exploit parallelism to enhance performance leading to interaction among operations and contention for resources. The deviation from the...
متن کاملAn upper bound for transforming self-verifying automata into deterministic ones
This paper describes a modification of the power set construction for the transformation of self-verifying nondeterministic finite automata to deterministic ones. Using a set counting argument, the upper bound for this transformation can be lowered from 2 to O( 2 n √ n ). Mathematics Subject Classification. 68Q10, 68Q19.
متن کاملSolving Games Without Determinization
The synthesis of reactive systems requires the solution of two-player games on graphs with ω-regular objectives. When the objective is specified by a linear temporal logic formula or nondeterministic Büchi automaton, then previous algorithms for solving the game require the construction of an equivalent deterministic automaton. However, determinization for automata on infinite words is extremel...
متن کاملTesting deterministic implementations from nondeterministic FSM specifications
In this paper, conformance testing of protocols specified as nondeterministic finite state machines is considered. Protocol implementations are assumed to be deterministic. In this testing scenario, the conformance relation becomes a preorder, so-called reduction relation between FSMs. The reduction relation requires that an implementation machine produces a (sub)set of output sequences that ca...
متن کاملNon-determinism and Probabilities in Timed Concurrent Constraint Programming (Extended Version)
We set the grounds of a framework for modeling and verifying systems involving probabilities, time, and partial information as constraints. A timed concurrent constraint process calculus with probabilistic and non-deterministic choices is proposed as description language. An operational semantics ensures consistent interactions between both kinds of choices. The semantics is also shown to be in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996